Scheduling and constraint propagation
نویسندگان
چکیده
منابع مشابه
Impact- and Cost-Oriented Propagator Scheduling for Faster Constraint Propagation
Constraint Propagation can be speeded up significantly by choosing a good execution order for propagators. A propagator is an implicit representation of a constraint which is widely used in todays powerful constraint solvers. In this paper we evaluate different ways to find good execution orders automatically during runtime. We extend previous work in this area by two new techniques: fair-sched...
متن کاملImproving Branch and Bound for Jobshop Scheduling with Constraint Propagation
Task intervals were defined in [CL94] for disjunctive scheduling so that, in a scheduling problem, one could derive much information by focusing on some key subsets of tasks. The advantage of this approach was to shorten the size of search trees for branch&bound algorithms because more propagation was performed at each node. In this paper, we refine the propagation scheme and describe in detail...
متن کاملEdge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling
Edge-finding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. The aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge-finding algorithms. The simplest case of non-preemptive disjunctive scheduling is reviewed first, f...
متن کاملConstraint Propagation for Domain Bounding in Distributed Task Scheduling
The coordinated management of inter-dependent plans or schedules belonging to different agents is a complex, real-world problem arising in diverse domains such as disaster rescue, small-team reconnaissance, and security patrolling. The problem is inherently a distributed one; no single agent has a global view and must make local scheduling decisions through collaboration with other agents to en...
متن کاملAgile Satellite Scheduling via Permutation Search with Constraint Propagation
Earth Observation Satellite (EOS) scheduling is an important oversubscribed constraint optimization problem. Permutation-based scheduling methods have recently been shown to be effective on these problems. However, the new agile EOS satellites present additional scheduling complexity because they allow image acquisition over a window of possible observation times. Constraint propagation algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00342-0